A new subspace iteration method for the algebraic Riccati equation
نویسندگان
چکیده
We consider the numerical solution of the continuous algebraic Riccati equation AX +XA−XFX +G = 0, with F = F , G = G of low rank and A large and sparse. We develop an algorithm for the low rank approximation of X by means of an invariant subspace iteration on a function of the associated Hamiltonian matrix. We show that the sought after approximation can be obtained by a low rank update, in the style of the well known ADI iteration for the linear equation, from which the new method inherits many algebraic properties. Moreover, we establish new insightful matrix relations with emerging projection-type methods, which will help increase our understanding of this latter class of solution strategies.
منابع مشابه
Optimal integrated passive/active design of the suspension system using iteration on the Lyapunov equations
In this paper, an iterative technique is proposed to solve linear integrated active/passive design problems. The optimality of active and passive parts leads to the nonlinear algebraic Riccati equation due to the active parameters and some associated additional Lyapunov equations due to the passive parameters. Rather than the solution of the nonlinear algebraic Riccati equation, it is proposed ...
متن کاملBlock Arnoldi-based methods for large scale discrete-time algebraic Riccati equations
Algebraic Riccati equations (discrete-time or continuous-time) play a fundamental role in many problems in control theory. They arise in linear-quadratic regulator problems, H ∞ or H 2-control, model reduction problems and many others. In this talk we propose numerical methods for large discrete-time algebraic Riccati equations (DARE). We present block projection methods that allow us to comput...
متن کاملLow Rank Approximate Solutions Obtained from a Different Application of Global Arnoldi̇ Method
The aim of this paper is to examine a numerical method for the computation of approximate solution of the continuous-time algebraic Riccati equation using Krylov subspace matrix. First of all, Global Arnoldi process is initiated to construct an orthonormal basis. In addition, Krylov subspace matrix is employed as projection method because it is one of the frequently referred method in the liter...
متن کاملA subspace shift technique for nonsymmetric algebraic Riccati equations associated with an M-matrix
The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M-matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive and one with negative real part. When both these eigenvalues are exactly zero, the problem is called critical or null recurrent. While in this case the problem...
متن کاملApplication of fractional-order Bernoulli functions for solving fractional Riccati differential equation
In this paper, a new numerical method for solving the fractional Riccati differential equation is presented. The fractional derivatives are described in the Caputo sense. The method is based upon fractional-order Bernoulli functions approximations. First, the fractional-order Bernoulli functions and their properties are presented. Then, an operational matrix of fractional order integration...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015